Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
551	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
552	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
553	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Analysis of algorithms Computational complexity theory Distributed computing Leader election Time complexity Distributed data storage Consensus Chang and Roberts algorithm Theoretical computer science Distributed algorithms Applied mathematics
554	Weak Formal Systems and Connections to Computational Complexity Lecture Notes for a Topics Course University of California, Berkeley January-May 1988 Add to Reading List Source URL: euclid.ucsd.edu Language: English - Date: 2006-04-24 18:16:59 Proof theory Automated theorem proving Propositional calculus Logical truth Logical syntax Sequent Cut-elimination theorem Substitution Resolution Logic Mathematical logic Mathematics
555	Scheduling and SAT Emmanuel Hebrard Toulouse Outline Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-02-17 02:59:42 Constraint programming Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Satisfiability NP-complete Model checking Theoretical computer science Applied mathematics Computational complexity theory
556	Research internship (Master M2) Title Verification of Distributed Systems with Parameterized Network Topology Description Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2014-10-08 10:04:52 Computational complexity theory Automata theory Symposium on Theoretical Aspects of Computer Science Cryptographic protocols Model checking Network topology
557	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics
558	Journal of Computer and System Sciences–737 Contents lists available at ScienceDirect Journal of Computer and System Sciences www.elsevier.com/locate/jcss Add to Reading List Source URL: math.mit.edu Language: English - Date: 2011-03-23 10:26:18 Applied mathematics Natural proof Pseudorandom generator Entailment Time complexity Circuit complexity Arithmetic function Holomorphic functional calculus Theoretical computer science Computational complexity theory Logic
559	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-05 11:21:00 Complexity classes Polygons Structural complexity theory Mathematical optimization Art gallery problem Approximation algorithm Reduction NP-complete Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
560	Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Spanning tree Fault-tolerant computer systems Analysis of algorithms Self-stabilization Minimum spanning tree Algorithm Time complexity Bellman–Ford algorithm Distributed computing Theoretical computer science Computational complexity theory Mathematics

UPDATE